Constructive negation under the well-founded semantics
نویسندگان
چکیده
منابع مشابه
Constructive Negation Under the Well-Founded Semantics
Constructive negation derives constraint answers for non-ground negative literals. Its incorporation into query evaluation under the well-founded semantics introduces two problems. One is the detection of repeated sub-goals and the elimination of redundant answers, which is required in order to guarantee termination. The other is the interaction between constraint answers of non-ground negative...
متن کاملForgetting under the Well-Founded Semantics
Recently, the notion of forgetting has drawn considerable attention in the area of Knowledge Representation and Reasoning. The underlying idea is to discard a part of the knowledge base without affecting the derivations on, e.g., atoms that are not to be forgotten. Several recent papers consider forgetting under answer set semantics, but sometimes the well-founded semantics with data complexity...
متن کاملDecidability Under the Well-Founded Semantics
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of rule systems for ontology reasoning, and also investigated as to its usefulness as a semantics for hybrid systems featuring combined openand closed-world reasoning. Even in its most basic form, however, the WFS is unde...
متن کاملA Logical Encoding of Well-Founded Semantics with Explicit Negation
In this work we revisit a previously obtained logical characterization of Well-Founded Semantics (WFS) and show now its application to Alferes and Pereira’s WFS variant (WFSX) for programs with explicit negation. In a previous work, we presented a full logical treatment of program connectives by interpreting them in an intermediate logic (we called two-dimensional here-and-there, HT ). This log...
متن کاملWell Founded Semantics for Logic Programs with Explicit Negation
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics 22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised 11]. This relationship improves the cross{fertilization between logic programs and default theories, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1999
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(98)10027-4